0.07/0.11	% Problem    : theBenchmark.p : TPTP v0.0.0. Released v0.0.0.
0.07/0.11	% Command    : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 240 THM
0.11/0.32	% Computer : n003.cluster.edu
0.11/0.32	% Model    : x86_64 x86_64
0.11/0.32	% CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
0.11/0.32	% Memory   : 8042.1875MB
0.11/0.32	% OS       : Linux 3.10.0-693.el7.x86_64
0.11/0.32	% CPULimit   : 1920
0.11/0.32	% WCLimit    : 240
0.11/0.32	% DateTime   : Wed Jul 30 07:45:49 EDT 2025
0.11/0.32	% CPUTime    : 
0.18/0.46	Running higher-order theorem proving
0.18/0.49	Running: /export/starexec/sandbox/solver/bin/eprover-ho --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --auto-schedule=8 --cpu-limit=240 /export/starexec/sandbox/tmp/tmp.6BYIXWUdXx/E---3.1_5515.p
0.47/0.53	# Version: 3.0.0-ho
0.47/0.53	# Preprocessing class: HSLMSMSSLLLCHSA.
0.47/0.53	# Scheduled 6 strats onto 8 cores with 240 seconds (1920 total)
0.47/0.53	# Starting lpo1_fix with 720s (3) cores
0.47/0.53	# Starting full_lambda_9 with 240s (1) cores
0.47/0.53	# Starting almost_fo_4 with 240s (1) cores
0.47/0.53	# Starting new_ho_9 with 240s (1) cores
0.47/0.53	# Starting pre_casc_4 with 240s (1) cores
0.47/0.53	# Starting ho_unfolding_6 with 240s (1) cores
0.47/0.53	# pre_casc_4 with pid 5597 completed with status 0
0.47/0.53	# Result found by pre_casc_4
0.47/0.53	# Preprocessing class: HSLMSMSSLLLCHSA.
0.47/0.53	# Scheduled 6 strats onto 8 cores with 240 seconds (1920 total)
0.47/0.53	# Starting lpo1_fix with 720s (3) cores
0.47/0.53	# Starting full_lambda_9 with 240s (1) cores
0.47/0.53	# Starting almost_fo_4 with 240s (1) cores
0.47/0.53	# Starting new_ho_9 with 240s (1) cores
0.47/0.53	# Starting pre_casc_4 with 240s (1) cores
0.47/0.53	# SinE strategy is GSinE(CountFormulas,,true,1.5,0,3,20000,1.0,true)
0.47/0.53	# Search class: HGUSM-FFMM31-DHSMMSBN
0.47/0.53	# partial match(3): HGHSM-FFMM31-SHSSMSBN
0.47/0.53	# Scheduled 6 strats onto 1 cores with 240 seconds (240 total)
0.47/0.53	# Starting new_ho_10 with 130s (1) cores
0.47/0.53	# new_ho_10 with pid 5599 completed with status 0
0.47/0.53	# Result found by new_ho_10
0.47/0.53	# Preprocessing class: HSLMSMSSLLLCHSA.
0.47/0.53	# Scheduled 6 strats onto 8 cores with 240 seconds (1920 total)
0.47/0.53	# Starting lpo1_fix with 720s (3) cores
0.47/0.53	# Starting full_lambda_9 with 240s (1) cores
0.47/0.53	# Starting almost_fo_4 with 240s (1) cores
0.47/0.53	# Starting new_ho_9 with 240s (1) cores
0.47/0.53	# Starting pre_casc_4 with 240s (1) cores
0.47/0.53	# SinE strategy is GSinE(CountFormulas,,true,1.5,0,3,20000,1.0,true)
0.47/0.53	# Search class: HGUSM-FFMM31-DHSMMSBN
0.47/0.53	# partial match(3): HGHSM-FFMM31-SHSSMSBN
0.47/0.53	# Scheduled 6 strats onto 1 cores with 240 seconds (240 total)
0.47/0.53	# Starting new_ho_10 with 130s (1) cores
0.47/0.53	# Preprocessing time       : 0.004 s
0.47/0.53	# Presaturation interreduction done
0.47/0.53	
0.47/0.53	# Proof found!
0.47/0.53	# SZS status Theorem
0.47/0.53	# SZS output start CNFRefutation
0.47/0.53	thf(decl_23, type, is_of: $i > ($i > $o) > $o).
0.47/0.53	thf(decl_24, type, all_of: ($i > $o) > ($i > $o) > $o).
0.47/0.53	thf(decl_26, type, in: $i > $i > $o).
0.47/0.53	thf(decl_48, type, ordsucc: $i > $i).
0.47/0.53	thf(decl_78, type, e_is: $i > $i > $i > $o).
0.47/0.53	thf(decl_124, type, nat: $i).
0.47/0.54	thf(decl_125, type, n_is: $i > $i > $o).
0.47/0.54	thf(decl_143, type, n_pl: $i > $i > $i).
0.47/0.54	thf(decl_144, type, esk1_0: $i).
0.47/0.54	thf(decl_145, type, esk2_0: $i).
0.47/0.54	thf(def_all_of, axiom, ((all_of)=(^[X3:$i > $o, X2:$i > $o]:(![X4:$i]:(((is_of @ X4 @ X3)=>(X2 @ X4)))))), file('/export/starexec/sandbox/tmp/tmp.6BYIXWUdXx/E---3.1_5515.p', def_all_of)).
0.47/0.54	thf(def_is_of, axiom, ((is_of)=(^[X1:$i, X2:$i > $o]:((X2 @ X1)))), file('/export/starexec/sandbox/tmp/tmp.6BYIXWUdXx/E---3.1_5515.p', def_is_of)).
0.47/0.54	thf(def_e_is, axiom, ((e_is)=(^[X1:$i, X60:$i, X61:$i]:(((X60)=(X61))))), file('/export/starexec/sandbox/tmp/tmp.6BYIXWUdXx/E---3.1_5515.p', def_e_is)).
0.47/0.54	thf(def_n_is, axiom, ((n_is)=(^[Z0/* 19 */:$i, Z1:$i]:(((Z0)=(Z1))))), file('/export/starexec/sandbox/tmp/tmp.6BYIXWUdXx/E---3.1_5515.p', def_n_is)).
0.47/0.54	thf(satz4h, conjecture, (all_of @ (^[X1:$i]:((in @ X1 @ nat))) @ (^[X1:$i]:((all_of @ (^[X184:$i]:((in @ X184 @ nat))) @ (^[X185:$i]:((n_is @ (ordsucc @ (n_pl @ X1 @ X185)) @ (n_pl @ (ordsucc @ X1) @ X185)))))))), file('/export/starexec/sandbox/tmp/tmp.6BYIXWUdXx/E---3.1_5515.p', satz4h)).
0.47/0.54	thf(satz4d, axiom, (all_of @ (^[X1:$i]:((in @ X1 @ nat))) @ (^[X1:$i]:((all_of @ (^[X179:$i]:((in @ X179 @ nat))) @ (^[X180:$i]:((n_is @ (n_pl @ (ordsucc @ X1) @ X180) @ (ordsucc @ (n_pl @ X1 @ X180))))))))), file('/export/starexec/sandbox/tmp/tmp.6BYIXWUdXx/E---3.1_5515.p', satz4d)).
0.47/0.54	thf(c_0_6, plain, ((all_of)=(^[Z0/* 19 */:$i > $o, Z1:$i > $o]:(![X4:$i]:((((Z0 @ X4))=>(Z1 @ X4)))))), inference(fof_simplification,[status(thm)],[def_all_of])).
0.47/0.54	thf(c_0_7, plain, ((is_of)=(^[Z0/* 19 */:$i, Z1:$i > $o]:((Z1 @ Z0)))), inference(fof_simplification,[status(thm)],[def_is_of])).
0.47/0.54	thf(c_0_8, plain, ((e_is)=(^[Z0/* 19 */:$i, Z1:$i, Z2:$i]:(((Z1)=(Z2))))), inference(fof_simplification,[status(thm)],[def_e_is])).
0.47/0.54	thf(c_0_9, plain, ((all_of)=(^[Z0/* 19 */:$i > $o, Z1:$i > $o]:(![X4:$i]:((((Z0 @ X4))=>(Z1 @ X4)))))), inference(apply_def,[status(thm)],[c_0_6, c_0_7])).
0.47/0.54	thf(c_0_10, axiom, ((n_is)=(^[Z0/* 19 */:$i, Z1:$i]:(((Z0)=(Z1))))), inference(apply_def,[status(thm)],[def_n_is, c_0_8])).
0.47/0.54	thf(c_0_11, negated_conjecture, ~(![X282:$i]:(((in @ X282 @ nat)=>![X281:$i]:(((in @ X281 @ nat)=>((ordsucc @ (n_pl @ X282 @ X281))=(n_pl @ (ordsucc @ X282) @ X281))))))), inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[satz4h])]), c_0_9]), c_0_10])).
0.47/0.54	thf(c_0_12, plain, ![X286:$i]:(((in @ X286 @ nat)=>![X285:$i]:(((in @ X285 @ nat)=>((n_pl @ (ordsucc @ X286) @ X285)=(ordsucc @ (n_pl @ X286 @ X285))))))), inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(fof_simplification,[status(thm)],[satz4d]), c_0_9]), c_0_10])).
0.47/0.54	thf(c_0_13, negated_conjecture, ((in @ esk1_0 @ nat)&((in @ esk2_0 @ nat)&((ordsucc @ (n_pl @ esk1_0 @ esk2_0))!=(n_pl @ (ordsucc @ esk1_0) @ esk2_0)))), inference(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_11])])])])).
0.47/0.54	thf(c_0_14, plain, ![X351:$i, X352:$i]:((~(in @ X351 @ nat)|(~(in @ X352 @ nat)|((n_pl @ (ordsucc @ X351) @ X352)=(ordsucc @ (n_pl @ X351 @ X352)))))), inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_12])])])])).
0.47/0.54	thf(c_0_15, negated_conjecture, ((ordsucc @ (n_pl @ esk1_0 @ esk2_0))!=(n_pl @ (ordsucc @ esk1_0) @ esk2_0)), inference(split_conjunct,[status(thm)],[c_0_13])).
0.47/0.54	thf(c_0_16, plain, ![X1:$i, X4:$i]:((((n_pl @ (ordsucc @ X1) @ X4)=(ordsucc @ (n_pl @ X1 @ X4)))|~((in @ X1 @ nat))|~((in @ X4 @ nat)))), inference(split_conjunct,[status(thm)],[c_0_14])).
0.47/0.54	thf(c_0_17, negated_conjecture, (in @ esk2_0 @ nat), inference(split_conjunct,[status(thm)],[c_0_13])).
0.47/0.54	thf(c_0_18, negated_conjecture, (in @ esk1_0 @ nat), inference(split_conjunct,[status(thm)],[c_0_13])).
0.47/0.54	thf(c_0_19, negated_conjecture, ($false), inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_15, c_0_16]), c_0_17]), c_0_18])]), ['proof']).
0.47/0.54	# SZS output end CNFRefutation
0.47/0.54	# Parsed axioms                        : 314
0.47/0.54	# Removed by relevancy pruning/SinE    : 244
0.47/0.54	# Initial clauses                      : 110
0.47/0.54	# Removed in clause preprocessing      : 3
0.47/0.54	# Initial clauses in saturation        : 107
0.47/0.54	# Processed clauses                    : 148
0.47/0.54	# ...of these trivial                  : 4
0.47/0.54	# ...subsumed                          : 8
0.47/0.54	# ...remaining for further processing  : 136
0.47/0.54	# Other redundant clauses eliminated   : 2
0.47/0.54	# Clauses deleted for lack of memory   : 0
0.47/0.54	# Backward-subsumed                    : 0
0.47/0.54	# Backward-rewritten                   : 0
0.47/0.54	# Generated clauses                    : 21
0.47/0.54	# ...of the previous two non-redundant : 15
0.47/0.54	# ...aggressively subsumed             : 0
0.47/0.54	# Contextual simplify-reflections      : 0
0.47/0.54	# Paramodulations                      : 15
0.47/0.54	# Factorizations                       : 0
0.47/0.54	# NegExts                              : 0
0.47/0.54	# Equation resolutions                 : 3
0.47/0.54	# Disequality decompositions           : 0
0.47/0.54	# Total rewrite steps                  : 20
0.47/0.54	# ...of those cached                   : 7
0.47/0.54	# Propositional unsat checks           : 0
0.47/0.54	#    Propositional check models        : 0
0.47/0.54	#    Propositional check unsatisfiable : 0
0.47/0.54	#    Propositional clauses             : 0
0.47/0.54	#    Propositional clauses after purity: 0
0.47/0.54	#    Propositional unsat core size     : 0
0.47/0.54	#    Propositional preprocessing time  : 0.000
0.47/0.54	#    Propositional encoding time       : 0.000
0.47/0.54	#    Propositional solver time         : 0.000
0.47/0.54	#    Success case prop preproc time    : 0.000
0.47/0.54	#    Success case prop encoding time   : 0.000
0.47/0.54	#    Success case prop solver time     : 0.000
0.47/0.54	# Current number of processed clauses  : 39
0.47/0.54	#    Positive orientable unit clauses  : 18
0.47/0.54	#    Positive unorientable unit clauses: 0
0.47/0.54	#    Negative unit clauses             : 5
0.47/0.54	#    Non-unit-clauses                  : 16
0.47/0.54	# Current number of unprocessed clauses: 68
0.47/0.54	# ...number of literals in the above   : 224
0.47/0.54	# Current number of archived formulas  : 0
0.47/0.54	# Current number of archived clauses   : 96
0.47/0.54	# Clause-clause subsumption calls (NU) : 935
0.47/0.54	# Rec. Clause-clause subsumption calls : 363
0.47/0.54	# Non-unit clause-clause subsumptions  : 8
0.47/0.54	# Unit Clause-clause subsumption calls : 8
0.47/0.54	# Rewrite failures with RHS unbound    : 0
0.47/0.54	# BW rewrite match attempts            : 2
0.47/0.54	# BW rewrite match successes           : 0
0.47/0.54	# Condensation attempts                : 148
0.47/0.54	# Condensation successes               : 0
0.47/0.54	# Termbank termtop insertions          : 15961
0.47/0.54	# Search garbage collected termcells   : 4637
0.47/0.54	
0.47/0.54	# -------------------------------------------------
0.47/0.54	# User time                : 0.024 s
0.47/0.54	# System time              : 0.003 s
0.47/0.54	# Total time               : 0.027 s
0.47/0.54	# Maximum resident set size: 3020 pages
0.47/0.54	
0.47/0.54	# -------------------------------------------------
0.47/0.54	# User time                : 0.031 s
0.47/0.54	# System time              : 0.007 s
0.47/0.54	# Total time               : 0.038 s
0.47/0.54	# Maximum resident set size: 2148 pages
0.47/0.54	% E exiting
0.47/0.54	% E exiting
0.47/0.54	EOF